A Trichotomy: Interactions of Factors Prolonging Sequential and Concurrent Mental Processes in Stochastic Discrete Mental (PERT) Networks

نویسندگان

  • RICHARD SCHWEICKERT
  • JAMES T. TOWNSEND
چکیده

Suppose the mental processes required for performing a task are partially ordered. so that some pairs of processes are sequential and some are concurrent. Then they <:an be represented in a directed acyclic network. a PERT network. Suppose the duration or each proc:ess is a nonneptive random variable. Suppose two experimental factors are available. each selectively prolonpns a dill'erent proc:ess by adding a nonnegative random variable 10 ils duration. Sternberg (\969) pointed out that if all the processes are in series. the faelors will have additive effeCtson melion time, Here we show that if the faelors affect concurrent proc:csses, the facton will have subadditive effCClS. Subadditive effects are also possible if the prolonged processes are sequential, but in a Wheatstone bridge. If the PERT network has no subnetwork homeomorphic 10 a Wheatstone bridge. then ineractions belween factors prolonpng sequen. tial processes will be nonnegative. and in praclice will often be positive. The results are illustrated. in a detailed analysis of a particular network. the Embellished Wheatstone Bridge.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combination of Approximation and Simulation Approaches for Distribution Functions in Stochastic Networks

This paper deals with the fundamental problem of estimating the distribution function (df) of the duration of the longest path in the stochastic activity network such as PERT network. First a technique is introduced to reduce variance in Conditional Monte Carlo Sampling (CMCS). Second, based on this technique a new procedure is developed for CMCS. Third, a combined approach of simulation and ap...

متن کامل

Expected Duration of Dynamic Markov PERT Networks

Abstract : In this paper , we apply the stochastic dynamic programming to approximate the mean project completion time in dynamic Markov PERT networks. It is assumed that the activity durations are independent random variables with exponential distributions, but some social and economical problems influence the mean of activity durations. It is also assumed that the social problems evolve in ac...

متن کامل

A special Class of Stochastic PERT Networks

Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure.&#10In series-parallel SPN, the completion time distribution...

متن کامل

A special Class of Stochastic PERT Networks

Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure. In series-parallel SPN, the completion time distribution f...

متن کامل

A New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks

In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009